Description: 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。
使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem.
Recursion and divide and conquer strategy algorithm to solve the problem of few: tower of Hanoi problem and binary search technology. Platform: |
Size: 3072 |
Author:阿丁汤圆 |
Hits:
Description: 实现0—1背包问题，使用动态规划，有注释。-0-1 knapsack problem, the use of dynamic programming, there are notes. Platform: |
Size: 486400 |
Author:陆小果 |
Hits:
Description: 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand. Platform: |
Size: 1024 |
Author:xuchao |
Hits:
Description: 分数背包的实现，在基础背包的前提下，增加分数属性，实现背包问题-The realization of the score backpack to increase the score property, under the premise of basic backpack, knapsack problem Platform: |
Size: 334848 |
Author:郝乾 |
Hits:
Description: Simple Matlab code for the 0-1 Knapsack problem: "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than a given limit and the total value is as large as possible" Platform: |
Size: 40960 |
Author:Thao |
Hits:
Description: 用回溯法解决背包问题
用回溯法解决背包问题-Use backtracking to solve knapsack problem using backtracking to solve knapsack problem Platform: |
Size: 1024 |
Author:付鹏 |
Hits:
Description: C#实现的01背包问题，里面使用了接口，适合初学者使用-C# implementation of the 01 knapsack problem, which uses the interface, suitable for beginners to use Platform: |
Size: 27648 |
Author: |
Hits:
Description: 算法设计与分析01背包优化问题实验
0-1背包问题：
: 有N个物品和一个背包，其中:
物品具有重量 (w1, w2, …, wn) 和价值 (v1, v2, …, vn)
背包的最大重量承受限制为c
如何放置物品可得最高价值?
思路：动态规划 -Algorithm Design and Analysis 01 knapsack optimization experiments 0-1 knapsack problem :: with N items and a backpack, which: goods with a weight (w1, w2, ..., wn) and value (v1, v2, ..., vn) Backpack The maximum weight limit is c bear how to place the highest value of the goods can be? ideas: Dynamic Programming Platform: |
Size: 1024 |
Author: |
Hits:
Description: 多种不同背包问题的解释和解答思路，适合初学者理解实现-Many different explanations and answers knapsack problem ideas for beginners to understand Platform: |
Size: 8192 |
Author:Guyue |
Hits:
Search - knapsack problem